| 翻訳と辞書 |
| S. Rao Kosaraju ： ウィキペディア英語版 |
S. Rao Kosaraju
Sambasiva Rao Kosaraju is a professor of computer science at Johns Hopkins University, and division director for Computing & Communication Foundations at the National Science Foundation.〔(Staff Announcement – CCF ), Farnam Jahanian, NSF, retrieved 2014-01-14.〕 He has done extensive work in the design and analysis of parallel and sequential algorithms.
In 1978, he wrote a paper describing a method to efficiently compute strongly connected members of a directed graph, a method later called Kosaraju's algorithm. Along with Paul Callahan he published many articles on efficient algorithms for computing the well-separated pair decomposition of a point set. His research efforts include efficient algorithms for pattern matching, data structure simulations, universal graphs, DNA sequence assembly, derandomization and investigations of immune system responses.〔http://www.cs.jhu.edu/~kosaraju/〕
In 1995 he was inducted as a Fellow of the Association for Computing Machinery. He is also a fellow of the IEEE. A common saying at Johns Hopkins University, "At some point, the learning stops and the pain begins." has been attributed to him. There used to be a shrine in the (CS Undergraduate Lab ) in his honor.
He was born in India, and he did his bachelors in Engineering from Andhra University, and Masters from IIT Kharagpur, and is a PhD from University of Pennsylvania.〔
== References ==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「S. Rao Kosaraju」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|